Reversible Watson–Crick automata

Representing Reversible Cellular Automata with Reversible Block Cellular Automata

Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local function. Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks. We prove that any d-dimensional reversible cellular automaton can be expressed as the composit...

On Reversible Automata

Probabilistic Reversible Automata and Quantum Automata

To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.

Reversible Cellular Automata

A reversible cellular automaton is one whose evolution, and therefore the entire past history of any con guration, can be uniquely deciphered. There are degrees of reversibility, depending upon whether the con gurations considered are arbitrary, periodic, or quiescent at in nity; which are subsidiary to more general questions of injectivity and surjectivity, within a general perspective of the ...

On Reversible Automata

A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states and we show that one can effectively decide whether a given rational (or regular) language can be...